Approximating bisimulation in one-counter nets
نویسندگان
چکیده
منابع مشابه
Simulation and Bisimulation over One-Counter Processes
We show an effective construction of (a periodicity description of) the maximal simulation relation for a given one-counter net. Then we demonstrate how to reduce simulation problems over one-counter nets to analogous bisimulation problems over one-counter automata. We use this to demonstrate the decidability of various problems, specifically testing regularity and strong regularity of one-coun...
متن کاملSimulation of One-Counter Nets via Colouring
Recently, Abdulla and Čerāns (1998) outlined an extensive and involved proof of the decidability of simulation preorder for one-counter nets. In this note, we present a short, complete proof based on simple colourings of the plane.1 1This paper was written during a visit by the first author to Uppsala University supported by a grant from the STINT Fellowship Programme. He is also partially supp...
متن کاملTrace Inclusion for One-Counter Nets Revisited
One-counter nets (OCN) consist of a nondeterministic finite control and a single integer counter that cannot be fully tested for zero. They form a natural subclass of both One-Counter Automata, which allow zero-tests and Petri Nets/VASS, which allow multiple such weak counters. The trace inclusion problem has recently been shown to be undecidable for OCN. In this paper, we contrast the complexi...
متن کاملSimulation Problems Over One-Counter Nets
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.
متن کاملSimulation is Decidable for One-counter Nets
We prove that the simulation preorder is decidable for the class of one-counter nets. A one-counter net consists of a nite-state machine operating on a variable (counter) which ranges over the natural numbers. Each transition can increase or decrease the value of the counter. A transition may not be performed if this implies that the value of the counter becomes negative. The class of one-count...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatic Control and Computer Sciences
سال: 2012
ISSN: 0146-4116,1558-108X
DOI: 10.3103/s014641161207005x